A games semantics for reductive logic and proof-search
نویسندگان
چکیده
Theorem proving, or algorithmic proof-search, is an essential enabling technology throughout the computational sciences. We explain the mathematical basis of proof-search as the combination of reductive logic together with a control régime. Then we present a games semantics for reductive logic and show how it may be used to model two important examples of control, namely backtracking and uniform proof.
منابع مشابه
Dialogues for proof search
Dialogue games are a two-player semantics for a variety of logics, including intuitionistic and classical logic. Dialogues can be viewed as a kind of analytic calculus not unlike tableaux. Can dialogue games be an effective foundation for proof search in intuitionistic logic (both first-order and propositional)? We announce Kuno, an automated theorem prover for intuitionistic first-order logic ...
متن کاملQuantifier rules in reductive proof using nominal semantics
Reductive proof-search tries to reduce a goal to tautologies. In the presence of quantifiers this becomes a complex design problem by which proof-theory shades into ‘proof-engineering’. There is no single right answer here, but there are a lot of practical problems with strong roots in theory. In this work we consider a nominal semantics for this design space. The reduction in complexity is str...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملMulti-Agent Dialogue Games and Dialogue Sequents for Proof Search and Scheduling
Dialogical games as introduced by Lorenzen and Lorenz describe a reasoning technique mainly used for intuitionistic and classical predicate logic: two players (proponent and opponent) argue about the validity of a given formula according to predefined rules. If the proponent has a winning-strategy then the formula is proven to be valid. The underlying game rules can be modified to have an impac...
متن کاملThick Subtrees, Games and Experiments
We relate the dynamic semantics (games, dealing with interactions) and the static semantics (dealing with results of interactions) of linear logic with polarities, in the spirit of Timeless Games [1]. The polarized game semantics is full and faithfull for polarized proof-nets [2]. We detail the correspondence between cut free proof-nets and innocent strategies, in a framework related to abstrac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005